- Title
- Can computing academics assess the difficulty of programming examination questions?
- Creator
- Simon,; Sheard, Judy; Carbone, Angela; D'Souza, Daryl; Harland, James; Laakso, Mikko-Jussi
- Relation
- 12th Koli Calling International Conference on Computing Education Research (Koli Calling '12). Koli Calling '12: Proceedings of the 12th Koli Calling International Conference on Computing Education Research (Koli, Finland 15-18 November, 2012) p. 160-163
- Publisher Link
- http://dx.doi.org/10.1145/2401796.2401822
- Publisher
- Association for Computing Machinery (ACM)
- Resource Type
- conference paper
- Date
- 2012
- Description
- This paper reports the results of a study investigating how accurately programming teachers can judge the level of difficulty of questions in introductory programming examinations. Having compiled a set of 45 questions that had been used in introductory programming exams, we took three measures of difficulty for the questions: the expectations of the person who taught the course and set the exams; the consensus expectations of an independent group of programming teachers; and the actual performance ofthe students who sat the exams. Good correlations were found between all pairs of the three measures. The conclusion, which is not controversial but needed to be established, is that computing academics do have a fairly good idea of the difficulty of programming exam questions, even for a course that they did not teach. However, the discussion highlights some areas where the relationships show weaknesses.
- Subject
- examination papers; CS1; introductory programming; assessment; question difficulty
- Identifier
- http://hdl.handle.net/1959.13/1307833
- Identifier
- uon:21538
- Identifier
- ISBN:9781450317955
- Language
- eng
- Reviewed
- Hits: 1896
- Visitors: 2125
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|